Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
61	Output-Sensitive Construction of the Union of Triangles Esther Ezra and Micha Sharir School of Computer Science Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2007-08-27 22:45:23 Computational complexity theory Theory of computation Analysis of algorithms NP-complete problems Set cover problem Randomized algorithm Time complexity Minimum spanning tree Point location
62	Channel Training and Estimation in Distributed Space-Time Coded Relay Networks with Multiple Transmit/Receive Antennas Sun Sun Yindi Jing Add to Reading List Source URL: www.comm.utoronto.ca Language: English - Date: 2013-07-09 12:30:00 Radio resource management Statistics Information theory Mathematical analysis IEEE 802 Mathematics Complexity classes Random matrices Cooperative diversity MIMO NP Wishart distribution
63	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:58 Computational complexity theory Complexity classes Theory of computation NP P Reduction Time complexity
64	May 19, Spring 2011 Final Exam Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:47:26 Mathematics Computational complexity theory Mathematical analysis Analysis of algorithms Operations research Mathematical notation Asymptotic analysis Dynamic programming Big O notation Time complexity Recurrence relation Knapsack problem
65	Improved Parallel Integer Sorting without Concurrent Writing Susanne Albersyz Torben Hagerupy Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 11:07:42 Sorting algorithms Mathematics Order theory Theory of computation Radix sort Bitonic sorter Time complexity Merge sort Integer sorting Computational complexity theory Algorithm Big O notation
66	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:56 Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP
67	Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann1 and Tobias Friedrich2,3 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:42 Computational complexity theory Theory of computation Complexity classes Polynomial-time approximation scheme BPP Time complexity NP NC
68	ALGORITHMIC LINEAR DIMENSION REDUCTION IN THE `1 NORM FOR SPARSE VECTORS A. C. GILBERT, M. J. STRAUSS, J. A. TROPP, AND R. VERSHYNIN Abstract. We can recover approximately a sparse signal with limited noise, i.e, a vecto Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2009-02-03 14:30:47 Digital signal processing Computational complexity theory Matrix Fast Fourier transform Time complexity Mathematics Computer science Theoretical computer science Polynomials
69	Brief Announcement: TheToolkit for Building Your Own Balls-into-Bins Algorithm Pierre Bertrand1 and Christoph Lenzen2 1 Ecole Normale Suprieure Cachan Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:02 Algorithm Mathematical logic Theoretical computer science Time complexity Mathematics With high probability Computer science Applied mathematics Balls into bins EdmondsPruhs protocol
70	CS711008Z Algorithm Design and Analysis Lecture 2. Analysis techniques 1 Dongbo Bu Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Analysis of algorithms Theory of computation Computational complexity theory Computer science Theoretical computer science Quicksort Average-case complexity Best worst and average case Algorithm Sorting algorithm Time complexity Worst-case complexity

UPDATE